System and method for influencing a position on a search result list generated by a computer network search engine

ABSTRACT

A method for providing a search result list. The method includes receiving a search request from a searcher. In a database of search listings in which each search listing is associated with an advertiser and includes at least one search term and a bid amount by the advertiser, search listings generating a match with the search request are identified. A predetermined number of identified search listings are selected according to bid amount for display to the searcher. The identified search listings are arranged for display in a random order as the search result list. The search result list is then communicated to the searcher.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of application Ser. No. 09/872,737, filed Jun. 1, 2001, in the name of inventor Thomas A. Soulanille, which is a continuation in part of application Ser. No. 09/322,677 filed May 28, 1999 in the names of Darren J. Davis, et al., now U.S. Pat. No. 6,269,361.

REFERENCE TO COMPUTER PROGRAM LISTINGS SUBMITTED ON COMPACT DISK

A compact disc appendix is included containing computer program code listings pursuant to 37 C.F.R. 1.52(e) and is hereby incorporated by reference in its entirety. The total number of compact discs is 1 including 22,808 files and 101,776,919 bytes. The files included on the compact disc are listed in a file entitled “dir_s” on the compact disc. Because of the large number of files contained on the compact disc, the required listing of file names, dates of creation and sizes in bytes is included in the file dir_s on the compact disk and incorporated by reference herein.

BACKGROUND OF THE INVENTION

The transfer of information over computer networks has become an increasingly important means by which institutions, corporations, and individuals do business. Computer networks have grown over the years from independent and isolated entities established to serve the needs of a single group into vast internets which interconnect disparate physical networks and allow them to function as a coordinated system. Currently, the largest computer network in existence is the Internet. The Internet is a worldwide interconnection of computer networks that communicate using a common protocol. Millions of computers, from low end personal computers to high end super computers, are connected to the Internet.

The Internet has emerged as a large community of electronically connected users located around the world who readily and regularly exchange significant amounts of information. The Internet continues to serve its original purposes of providing for access to and exchange of information among government agencies, laboratories, and universities for research and education. In addition, the Internet has evolved to serve a variety of interests and forums that extend beyond its original goals. In particular, the Internet is rapidly transforming into a global electronic marketplace of goods and services as well as of ideas and information.

This transformation of the Internet into a global marketplace was driven in large part by the introduction of an information system known as the World Wide Web (“the web”). The web is a unique distributed database designed to give wide access to a large universe of documents. The database records of the web are in the form of documents known as “pages”. These pages reside on web servers and are accessible via the Internet. The web is therefore a vast database of information dispersed across countless individual computer systems that is constantly changing and has no recognizable organization or morphology. Computers connected to the Internet may access the web pages via a program known as a browser, which has a powerful, simple-to-learn graphical user interface. One powerful technique supported by the web browser is known as hyperlinking, which permits web page authors to create links to other web pages which users can then retrieve by using simple point-and-click commands on the web browser.

The pages may be constructed in any one of a variety of formatting conventions, such as Hyper Text Markup Language (HTML), and may include multimedia information content such as graphics, audio, and moving pictures. Any person with a computer and a connection to the Internet may access any publicly accessible page posted on the web. Thus, a presence on the World Wide Web has the capability to introduce a worldwide base of consumers to businesses, individuals, and institutions seeking to advertise their products and services to potential customers. Furthermore, the ever increasing sophistication in the design of web pages, made possible by the exponential increase in data transmission rates and computer processing speeds, makes the web an increasingly attractive medium for advertising and other business purposes, as well as for the free flow of information.

The availability of powerful new tools that facilitate the development and distribution of Internet content has led to a proliferation of information, products, and services offered on the Internet and dramatic growth in the number of consumers using the Internet. International Data Corporation, commonly referred to as IDC, estimates that the number of Internet users will grow from approximately 97 million worldwide in 1998 to approximately 320 million worldwide by the end of 2002. In addition, commerce conducted over the Internet has grown and is expected to grow dramatically. IDC estimates that the percentage of Internet users buying goods and services on the Internet will increase from approximately 28% at the end of 1998 to approximately 40% in 2002, and that over the same period of time, the total value of goods and services purchased over the Internet will increase from approximately $32.4 billion to approximately $425.7 billion.

The Internet has emerged as an attractive new medium for advertisers of information, products and services to reach consumers. However, the World Wide Web is composed of a seemingly limitless number of web pages dispersed across millions of different computer systems all over the world in no discernible organization. Mechanisms, such as directories and search engines, have been developed to index and search the information available on the web and thereby help Internet users locate information of interest. These search services enable consumers to search the Internet for a listing of web sites based on a specific topic, product, or service of interest.

Search services are, after e-mail, the most frequently used tool on the Internet. As a result, web sites providing search services have offered advertisers significant reach into the Internet audience and have given advertisers the opportunity to target consumer interests based on keyword or topical search requests.

In a web-based search on an Internet search engine, a user enters a search term comprising one or more keywords, which the search engine then uses to generate, in real time, a listing of web pages that the user may access via a hyperlink. The search engines and web site directories of the prior art, however, rely upon processes for assigning results to keywords that often generate irrelevant search results. The automated search technology that drives many search engines in the prior art rely in large part on complex, mathematics-based database search algorithms that select and rank web pages based on multiple criteria such as keyword density and keyword location. The search results generated by such mechanisms often rely on blind mathematical formulas and may be random and even irrelevant. In addition, search engines that use automated search technology to catalog search results generally rely on invisible web site descriptions, or “meta tags”, that are authored by web site promoters. Web site owners may freely tag their sites as they choose. Consequently, some web site promoters or promoters insert popular search terms into their web site meta tags which are not relevant because by doing so they may attract additional consumer attention at little to no marginal cost. Finally, many web sites have similar meta tags, and the search engines of the prior art are simply not equipped to prioritize results in accordance with consumers' preferences.

Search engines and web site directories may also rely on the manual efforts of limited editorial staffs to review web page information. Since comprehensive manual review and indexing of an unpredictable, randomly updated database such as the web is an impossible task, search engine results are often incomplete or out-of-date. Moreover, as the volume and diversity of Internet content has grown, on many popular web search sites, consumers must frequently click-through multiple branches of a hierarchical directory to locate web sites responsive to their search request, a process that is slow and unwieldy from the consumer's standpoint. Thus, the prior art search engines are ineffective for web page owners seeking to target their web exposure and distribute information to the attention of interested users on a current and comprehensive basis.

Furthermore, current paradigms for generating web site traffic, such as banner advertising, follow traditional advertising paradigms and fail to utilize the unique attributes of the Internet. In the banner advertising model, web site promoters seeking to promote and increase their web exposure often purchase space on the pages of popular commercial web sites. The web site promoters usually fill this space with a colorful graphic, known as a banner, advertising their own web site. The banner may act a hyperlink a visitor may click on to access the site. Like traditional advertising, banner advertising on the Internet is typically priced on an impression basis with advertisers paying for exposures to potential consumers. Banners may be displayed at every page access, or, on search engines, may be targeted to search terms. Nonetheless, impression-based advertising inefficiently exploits the Internet's direct marketing potential, as the click-through rate, the rate of consumer visits a banner generates to the destination site, may be quite low. Web site promoters are therefore paying for exposure to many consumers who are not interested in the product or service being promoted, as most visitors to a web site seek specific information and may not be interested in the information announced in the banner. Likewise, the banner often fails to reach interested individuals, since the banner is not generally searchable by search engines and the interested persons may not know where on the web to view the banner.

Thus, the traditional paradigms of advertising and search engine algorithms fail to effectively deliver relevant information via the World Wide Web to interested parties in a cost-effective manner. Internet advertising can offer a level of targetability, interactivity, and measurability not generally available in other media. With the proper tools, Internet advertisers have the ability to target their messages to specific groups of consumers and receive prompt feedback as to the effectiveness of their advertising campaigns.

Ideally, web site promoters should be able to control their placement in search result listings so that their listings are prominent in searches that are relevant to the content of their web site. The search engine functionality of the Internet needs to be focused in a new direction to facilitate an on-line marketplace which offers consumers quick, easy and relevant search results while providing Internet advertisers and promoters with a cost-effective way to target consumers. A consumer utilizing a search engine that facilitates this on-line marketplace will find companies or businesses that offer the products, services, or information that the consumer is seeking. In this on-line marketplace, companies selling products, services, or information bid in an open auction environment for positions on a search result list generated by an Internet search engine. Since advertisers must pay for each click-through referral generated through the search result lists generated by the search engine, advertisers have an incentive to select and bid on those search keywords that are most relevant to their web site offerings. The higher an advertiser's position on a search result list, the higher likelihood of a “referral”; that is, the higher the likelihood that a consumer will be referred to the advertiser's web site through the search result list. The openness of this advertising marketplace is further facilitated by publicly displaying, to consumers and other advertisers, the price bid by an advertiser on a particular search result listing.

Accordingly, there is a need for an improved method and apparatus for selecting and ordering search result listings that can maximize revenue for the search engine operator as well as improving click through rates for web site promoters.

BRIEF SUMMARY

By way of introduction only, the present invention provides, in one embodiment, a method for providing a search result list. The method includes receiving a search request from a searcher. In a database of search listings in which each search listing is associated with an advertiser and includes at least one search term and a bid amount by the advertiser, search listings generating a match with the search request are identified. A predetermined number of identified search listings are selected according to bid amount for display to the searcher. The identified search listings are arranged for display in a random order as the search result list. The search result list is then communicated to the searcher.

In another embodiment, present invention provides a method for providing a search result list which includes receiving a search request from a searcher and, in a database of search listings associated with an advertiser and including a search term and a bid amount, identifying search listings having search terms generating a match with the search request. The method further includes selecting according to bid amount a predetermined number of identified search listings for display to the searcher and arranging as the search result list the identified search listings for display in a random order weighted according to the bid amount associated with each respective identified search listing. The method further includes communicating the search result list to the searcher.

In yet another embodiment, the present invention provides a method for providing a search result list which includes receiving a search request from a searcher and, in a database of search listings, identifying search listings having search terms generating a match with the search request. The method further includes selecting according to bid amount a variable number of identified search listings for display to the searcher, wherein the number of selected identified search listings is a function of the bid amounts for the identified search listings. The method further includes arranging the identified search listings for display as the search result list and communicating the search result list to the searcher.

The foregoing discussion of the preferred embodiments has been provided only by way of introduction. Nothing in this section should be taken as a limitation on the following claims, which define the scope of the invention.

BRIEF DESCRIPTION OF SEVERAL VIEWS OF THE DRAWINGS

FIG. 1 is a block diagram illustrating the relationship between a large network and one embodiment of the system and method for generating a pay-for-performance search result of the present invention;

FIG. 2 is a chart of menus, display screens, and input screens used in one embodiment of the present invention;

FIG. 3 is a flow chart illustrating the advertiser user login process performed in one embodiment of the present invention;

FIG. 4 is a flow chart illustrating the administrative user login process performed in one embodiment of the present invention;

FIG. 5 is a diagram of data for an account record for use with one embodiment of the present invention;

FIG. 6 is a flow chart illustrating a method of adding money to an account record used in one embodiment of the present invention;

FIG. 7 illustrates an example of a search result list generated by one embodiment of the present invention;

FIG. 8 is a flow chart illustrating a change bids process used in one embodiment of the present invention;

FIG. 9 illustrates an example of a screen display used in the change bids process of FIG. 8;

FIG. 10 is a flow diagram illustrating a method for selecting search listings for display as search results;

FIG. 11 is a flow diagram illustrating an alternative embodiment of a method for selecting search listing for display as search results;

FIG. 12 is a flow diagram illustrating a method for ordering selected listings for display as search results; and

FIG. 13 is flow diagram illustrating a method for ordering selected listings for display as search results.

DETAILED DESCRIPTION OF THE PRESENTLY PREFERRED EMBODIMENTS

Methods and systems for generating a pay-for-performance search result determined by a site promoter, such as an advertiser, over a client/server based computer network system are disclosed. The following description is presented to enable any person skilled in the art to make and use the invention. For purposes of explanation, specific nomenclature is set forth to provide a thorough understanding of the present invention. Descriptions of specific applications are provided only as examples. Various modifications to the preferred embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features disclosed herein.

Referring now to the drawings, FIG. 1 is an example of a distributed system 10 configured as client/server architecture used in a preferred embodiment of the present invention. A “client” is a member of a class or group that uses the services of another class or group to which it is not related. In the context of a computer network, such as the Internet, a client is a process (i.e. roughly a program or task) that requests a service which is provided by another process, known as a server program. The client process uses the requested service without having to know any working details about the other server program or the server itself. In networked systems, a client process usually runs on a computer that accesses shared network resources provided by another computer running a corresponding server process. However, it should also be noted that it is possible for the client process and the server process to run on the same computer.

A “server” is typically a remote computer system that is accessible over a communications medium such as the Internet. The client process may be active in a second computer system, and communicate with the server process over a communications medium that allows multiple clients to take advantage of the information-gathering capabilities of the server. Thus, the server essentially acts as an information provider for a computer network.

The block diagram of FIG. 1 therefore shows a distributed system 10 comprising a plurality of client computers 12, a plurality of advertiser web servers 14, an account management server 22, and a search engine web server 24, all of which are connected to a network 20. The network 20 will be hereinafter generally referred to as the Internet. Although the system and method of the present invention is specifically useful for the Internet, it should be understood that the client computers 12, advertiser web servers 14, account management server 22, and search engine web server 24 may be connected together through one of a number of different types of networks. Such networks may include local area networks (LANs), other wide area networks (WANs), and regional networks accessed over telephone lines, such as commercial information services. The client and server processes may even comprise different programs executing simultaneously on a single computer.

The client computers 12 can be conventional personal computers (PCs), workstations, or computer systems of any other size. Each client 12 typically includes one or more processors, memories, input/output devices, and a network interface, such as a conventional modem. The advertiser web servers 14, account management server 22, and the search engine web server 24 can be similarly configured. However, advertiser web servers 14, account management server 22, and search engine web server 24 may each include many computers connected by a separate private network. In fact, the network 20 may include hundreds of thousands of individual networks of computers.

The client computers 12 can execute web browser programs 16, such as the NAVIGATOR, EXPLORER, or MOSAIC browser programs, to locate the web pages or records 30 stored on advertiser server 14. The browser programs 16 allow the users to enter addresses of specific web pages 30 to be retrieved. These addresses are referred to as Uniform Resource Locators, or URLs. In addition, once a page has been retrieved, the browser programs 16 can provide access to other pages or records when the user “clicks” on hyperlinks to other web pages. Such hyperlinks are located within the web pages 30 and provide an automated way for the user to enter the URL of another page and to retrieve that page. The pages can be data records including as content plain textual information, or more complex digitally encoded multimedia content, such as software programs, graphics, audio signals, videos, and so forth.

In a preferred embodiment of the present invention, shown in FIG. 1, client computers 12 communicate through the network 20 with various network information providers, including account management server 22, search engine server 24, and advertiser servers 14 using the functionality provided by a HyperText Transfer Protocol (HTTP), although other communications protocols, such as FTP, SNMP, TELNET, and a number of other protocols known in the art, may be used. Preferably, search engine server 24, account management server 22, and advertiser servers 14 are located on the World Wide Web.

As discussed above, at least two types of server are contemplated in a preferred embodiment of the present invention. The first server contemplated is an account management server 22 comprising a computer storage medium 32 and a processing system 34. A database 38 is stored on the storage medium 32 of the account management server 22. The database 38 contains advertiser account information. It will be appreciated from the description below that the system and method of the present invention may be implemented in software that is stored as executable instructions on a computer storage medium, such as memories or mass storage devices, on the account management server 22. Conventional browser programs 16, running on client computers 12, may be used to access advertiser account information stored on account management server 22. Preferably, access to the account management server 22 is accomplished through a firewall, not shown, which protects the account management and search result placement programs and the account information from external tampering. Additional security may be provided via enhancements to the standard communications protocols such as Secure HTTP or the Secure Sockets Layer.

The second server type contemplated is a search engine web server 24. A search engine program permits network users, upon navigating to the search engine web server URL or sites on other web servers capable of submitting queries to the search engine web server 24 through their browser program 16, to type keyword queries to identify pages of interest among the millions of pages available on the World Wide Web. In a preferred embodiment of the present invention, the search engine web server 24 generates a search result list that includes, at least in part, relevant entries obtained from and formatted by the results of the bidding process conducted by the account management server 22. The search engine web server 24 generates a list of hypertext links to documents that contain information relevant to search terms entered by the user at the client computer 12. The search engine web server transmits this list, in the form of a web page, to the network user, where it is displayed on the browser 16 running on the client computer 12. A presently preferred embodiment of the search engine web server may be found by navigating to the web page at URL http://www.goto.com/. In addition, the search result list web page, an example of which is presented in FIG. 7, will be discussed below in further detail.

Search engine web server 24 is connected to the Internet 20. In a preferred embodiment of the present invention, search engine web server 24 includes a search database 40 comprised of search listing records used to generate search results in response to user queries. In addition, search engine web server 24 may also be connected to the account management server 22. Account management server 22 may also be connected to the Internet. The search engine web server 24 and the account management server 22 of the present invention address the different information needs of the users located at client computers 12.

For example, one class of users located at client computers 12 may be network information providers such as advertising web site promoters or owners having advertiser web pages 30 located on advertiser web servers 14. These advertising web site promoters, or advertisers, may wish to access account information residing in storage 32 on account management server 22. An advertising web site promoter may, through the account residing on the account management server 22, participate in a competitive bidding process with other advertisers. An advertiser may bid on any number of search terms relevant to the content of the advertiser's web site. In one embodiment of the present invention, the relevance of a bidded search term to an advertiser's web site is determined through a manual editorial process prior to insertion of the search listing containing the search term and advertiser web site URL into the database 40. In an alternate embodiment of the present invention, the relevance of a bidded search term in a search listing to the corresponding web site may be evaluated using a computer program executing at processor 34 of account management server 22, where the computer program will evaluate the search term and corresponding web site according to a set of predefined editorial rules.

The higher bids receive more advantageous placement on the search result list page generated by the search engine 24 when a search using the search term bid on by the advertiser is executed. In a preferred embodiment of the present invention, the amount bid by an advertiser comprises a money amount that is deducted from the account of the advertiser for each time the advertiser's web site is accessed via a hyperlink on the search result list page. A searcher “clicks” on the hyperlink with a computer input device to initiate a retrieval request to retrieve the information associated with the advertiser's hyperlink. Preferably, each access or “click” on a search result list hyperlink will be redirected to the search engine web server 24 to associate the “click” with the account identifier for an advertiser. This redirect action, which is not apparent to the searcher, will access account identification information coded into the search result page before accessing the advertiser's URL using the search result list hyperlink clicked on by the searcher. The account identification information is recorded in the advertiser's account along with information from the retrieval request as a retrieval request event. Since the information obtained through this mechanism conclusively matches an account identifier with a URL in a manner not possible using conventional server system logs known in the art, accurate account debit records will be maintained. Most preferably, the advertiser's web site description and hyperlink on the search result list page is accompanied by an indication that the advertiser's listing is a paid listing. Most preferably, each paid listing displays a “cost to advertiser,” which is an amount corresponding to a “price-per-click” paid by the advertiser for each referral to the advertiser's site through the search result list.

A second class of users at client computers 12 may comprise searchers seeking specific information on the web. The searchers may access, through their browsers 16, a search engine web page 36 residing on web server 24. The search engine web page 36 includes a query box in which a searcher may type a search term comprising one or more keywords. Alternatively, the searcher may query the search engine web server 24 through a query box hyperlinked to the search engine web server 24 and located on a web page stored at a remote web server. When the searcher has finished entering the search term, the searcher may transmit the query to the search engine web server 24 by clicking on a provided hyperlink. The search engine web server 24 will then generate a search result list page and transmit this page to the searcher at the client computer 12.

The searcher may click on the hypertext links associated with each listing on the search results page to access the corresponding web pages. The hypertext links may access web pages anywhere on the Internet, and include paid listings to advertiser web pages 18 located on advertiser web servers 14. In a preferred embodiment of the present invention, the search result list also includes non-paid listings that are not placed as a result of advertiser bids and are generated by a conventional World Wide Web search engine, such as the INKTOMI, LYCOS, or YAHOO! search engines. The non-paid hypertext links may also include links manually indexed into the database 40 by an editorial team. Most preferably, the non-paid listings follow the paid advertiser listings on the search results page.

FIG. 2 is a diagram showing menus, display screens, and input screens presented to an advertiser accessing the account management server 22 through a conventional browser program 16. The advertiser, upon entering the URL of the account management server 22 into the browser program 16 of FIG. 1, invokes a login application, discussed below as shown at screen 110 of FIG. 2, running on the processing system 34 of the server 22. Once the advertiser is logged-in, the processing system 34 provides a menu 120 that has a number of options and further services for advertisers. These items, which will be discussed in more detail below, cause routines to be invoked to either implement the advertiser's request or request further information prior to implementing the advertiser's request. In one embodiment of the present invention, the advertiser may access several options through menu 120, including requesting customer service 130, viewing advertiser policies 140, performing account administration tasks 150, adding money to the advertiser's account 160, managing the account's advertising presence on the search engine 170, and viewing activity reports 180. Context-specific help 190 may also generally be available at menu 120 and all of the above-mentioned options.

The login procedure of the preferred embodiment of the present invention is shown in FIGS. 3 and 4 for two types of user. FIG. 3 shows the login procedures 270 for an advertiser. FIG. 4 shows the login procedures 290 for an administrator managing and maintaining the system and method of the present invention. As discussed above, the advertiser or administrator at a client computer 12 must first use a browser program at steps 271 or 291 to access the account management server. After the advertiser navigates to the URL of the login page to start the login process at step 272 or 292, the processing system 34 of the account management server 22 invokes a login application at steps 274 or 294. According to this application, the processor provides an input screen 110 (FIG. 2) that requests the advertiser's or administrator's user name and password. These items of information are provided at steps 276 or 296 to a security application known in the art for the purpose of authentication, based on the account information stored in a database stored in storage 32 of account management server 22.

According to FIG. 3, after the user has been authenticated as an advertiser, the advertiser is provided with the menu screen 120 of FIG. 2 and limited read/write access privileges only to the corresponding advertiser account, as shown in step 278. The advertiser login event 278 may also be recorded in step 280 in an audit trail data structure as part of the advertiser's account record in the database. The audit trail is preferably implemented as a series of entries in database 38, where each entry corresponds to an event wherein the advertiser's account record is accessed. Preferably, the audit trail information for an account record may be viewed by the account owner and other appropriate administrators.

However, if the user is authenticated as an administrator in step 295 of FIG. 4, the administrator is provided with specified administrative access privileges to all advertiser accounts as shown in step 296. The administrator login event 296 is recorded in step 297 in the audit trail data structure portion of the administrator's account record. This audit trail is preferably implemented as a series of entries in database 38, where each entry corresponds to an event wherein the administrator's account record is accessed. Most preferably, the administrator's audit trail information may be viewed by the account owner and other appropriate administrators.

Furthermore, instead of the general advertiser main menu shown to the authenticated advertiser users in step 282, the authenticated administrator is provided in step 298 with access to search the database 38 of advertiser accounts. Preferably, a database search interface is provided to the administrator that enables the administrator to select an advertiser account to monitor. For example, the interface may include query boxes in which the administrator may enter an account number or username or contact name corresponding to an account the administrator wishes to access. When the administrator selects an advertiser account to monitor in step 299, the administrator is then brought to the main advertiser page 120 of FIG. 2, which is also seen by the advertisers.

Access to the account information 32 located on the account management server 22 is restricted to users having an account record on the system, as only those users are provided with a valid login name and password. Password and login name information is stored along with the user's other account information in the database 38 of the account management server 22, as shown in FIG. 1. Account information, including a login user name and password, is entered in the database 38 of FIG. 1 via a separate online registration process that is outside the scope of the present invention.

FIG. 5 is a diagram showing the types of information contained in each advertiser account record 300 in the database. First, an advertiser account record 300 contains a username 302 and a password 304, used for online authentication as described above. The account record also contains contact information 310 (e.g., contact name, company name, street address, phone, e-mail address).

Contact information 310 is preferably utilized to direct communications to the advertiser when the advertiser has requested notification of key advertiser events under the notification option, discussed below. The account record 300 also contains billing information 320 (e.g., current balance, credit card information). The billing information 320 contains data accessed when the advertiser selects the option to add money to the advertiser's account. In addition, certain billing information, such as the current balance, may trigger events requiring notification under the notification option. The audit trail section 325 of an account record 300 contains a list of all events wherein the account record 300 is accessed. Each time an account record 300 is accessed or modified, by an administrator or advertiser a short entry describing the account access and/or modification event will be appended to the audit trail section 330 of the administrator or advertiser account that initiated the event. The audit trail information may then be used to help generate a history of transactions made by the account owner under the account.

The advertising information section 330 contains information needed to conduct the online bidding process of the present invention, wherein a position is determined for a web site description and hyperlink within a search result list generated by a search engine. The advertising data 330 for each user account 300 may be organized as zero or more subaccounts 340. Each subaccount 340 comprises at least one search listing 344. Each search listing corresponds to a bid on a search term. An advertiser may utilize subaccounts to organize multiple bids on multiple search terms, or to organize bids for multiple web sites. Subaccounts are also particularly useful for advertisers seeking to track the performance of targeted market segments. The subaccount superstructure is introduced for the benefit of the advertisers seeking to organize their advertising efforts, and does not affect the method of operation of the present invention. Alternatively, the advertising information section need not include the added organizational layer of subaccounts, but may simply comprise one or more search listings.

The search listing 344 corresponds to a search term/bid pairing and contains key information to conduct the online competitive bidding process. Preferably, each search listing comprises the following information: search term 352, web site description 354, URL 356, bid amount 358, and a title 360. The search term 352 comprises one or more keywords which may be common words in English (or any other language). Each keyword in turn comprises a character string. The search term is the object of the competitive online bidding process. The advertiser selects a search term to bid on that is relevant to the content of the advertiser's web site. Ideally, the advertiser may select a search term that is targeted to terms likely to be entered by searchers seeking the information on the advertiser's web site, although less common search terms may also be selected to ensure comprehensive coverage of relevant search terms for bidding.

The web site description 354 is a short textual description (preferably less than 190 characters) of the content of the advertiser's web site and may be displayed as part of the advertiser's entry in a search result list. The search listing 344 may also contain a title 360 of the web site that may be displayed as the hyperlinked heading to the advertiser's entry in a search result list. The URL 356 contains the Uniform Resource Locator address of the advertiser's web site. When the user clicks on the hyperlink provided in the advertiser's search result list entry, the URL is provided to the browser program. The browser program, in turn, accesses the advertiser's web site through the redirection mechanism discussed above. The URL may also be displayed as part of the advertiser's entry in a search result list.

The bid amount 358 preferably is a money amount bid by an advertiser for a listing. This money amount is deducted from the advertiser's prepaid account or is recorded for advertiser accounts that are invoiced for each time a search is executed by a user on the corresponding search term and the search result list hyperlink is used to refer the searcher to the advertiser's web site. Finally, a rank value is a value generated dynamically, preferably by the processing system 34 of the account management server 22 shown in FIG. 1, each time an advertiser places a bid or a search enters a search query. The rank value of an advertiser's search listing determines the placement location of the advertiser's entry in the search result list generated when a search is executed on the corresponding search term. Preferably, rank value is an ordinal value determined in a direct relationship to the bid amount 358; the higher the bid amount, the higher the rank value, and the more advantageous the placement location on the search result list. Most preferably, the rank value of 1 is assigned to the highest bid amount with successively higher ordinal values (e.g., 2, 3, 4, . . . ) associated with successively lower ranks and assigned to successively lower bid amounts.

Once logged in, an advertiser can perform a number of straightforward tasks set forth in menu 120 of FIG. 2, including viewing a list of rules and policies for advertisers, and requesting customer service assistance. These items cause routines to be invoked to implement the request. For example, when “Customer Service” is selected, an input screen 130 is displayed to allow the advertiser to select the type of customer service requested. In addition, forms may be provided on screen 130 so that an advertiser may type a customer comment into a web-based input form.

When “View Advertiser Policies” is selected, a routine will be invoked by processing system 34 of the account management server 22 FIG. 1. As shown in FIG. 2, the routine will display an informational web page 140. The web page 140 sets forth the advertiser policies currently in effect (e.g., “All search listing descriptions must clearly relate to the search term”).

Menu 120 of FIG. 2 also includes an “Account Administration” selection 150 which allows an advertiser, among other things, to view and change the advertiser's contact information and billing information, or update the advertiser's access profile, if any. Web-based forms well known in the art and similar to those discussed above are provided for updating account information.

The “Account Administration” menu also includes a selection enabling an advertiser to view the transaction history of the advertiser's account. Under the “View Transaction History” selection, the advertiser may invoke routines to view a listing of past account transactions (e.g., adding money to account, adding or deleting bidded search terms, or changing a bid amount). Additional routines may be implemented to permit advertisers to display a history of transactions of a specified type, or that occur within a specified time. The transaction information may be obtained from the audit trail list 325 of FIG. 5, described above. Clickable buttons that may be implemented in software, web-based forms, and/or menus may be provided as known in the art to enable advertisers to specify such limitations.

In addition, the “Account Administration” menu 150 of FIG. 2 includes a selection enabling an advertiser to set notification options. Under this selection, the advertiser may select options that will cause the system to notify the advertiser when certain key events have occurred. For example, the advertiser may elect to set an option to have the system send conventional electronic mail messages to the advertiser when the advertiser's account balance has fallen below a specified level. In this manner, the advertiser may receive a “warning” to replenish the account before the account is suspended (meaning the advertiser's listings will no longer appear in search result lists). Another key event for which the advertiser may wish notification is a change in position of an advertiser's listing in the search result list generated for a particular search term. For example, an advertiser may wish to have the system send a conventional electronic mail message to the advertiser if the advertiser has been outbid by another advertiser for a particular search term (meaning that the advertiser's listing will appear in a position farther down on the search result list page than previously). When one of the system-specified key events occurs, a database search is triggered for each affected search listing. The system will then execute the appropriate notification routine in accordance with the notification options specified in the advertiser's account.

Referring back to FIG. 2, a selection also appears in menu 120 that permits an advertiser to add money to the advertiser's account, so that the advertiser will have funds in their account to pay for referrals to the advertiser's site through the search results page. Preferably, only advertisers with funds in their advertiser's accounts may have their paid listings included in any search result lists generated. Most preferably, advertisers meeting selected business criteria may elect, in place of maintaining a positive account balance at all times, incur account charges regardless of account balance and pay an invoiced amount at regular intervals which reflects the charges incurred by actual referrals to the advertiser's site generated by the search engine. The process that is executed when the “Add Money to Account” selection is invoked is shown in further detail in FIG. 6, beginning at step 602. When the “Add Money to Account” selection is clicked in step 604, a function is invoked which receives data identifying the advertiser and retrieves the advertiser's account from the database. The executing process then stores the advertiser's default billing information and displays the default billing information for the advertiser in step 606. The displayed billing information includes a default amount of money to be added, a default payment type, and default instrument information.

In the preferred embodiment of the present invention, an advertiser may add funds online and substantially in real time through the use of a credit card, although the use of other payment types are certainly well within the scope of the present invention. For example, in an alternate embodiment of the present invention, advertisers may add funds to their account by transferring the desired amount from the advertiser's bank account through an electronic funds verification mechanism known in the art such as debit cards, in a manner similar to that set forth in U.S. Pat. No. 5,724,424 to Gifford. In another alternate embodiment of the present invention, advertisers can add funds to their account using conventional paper-based checks. In that case, the additional funds may be updated in the account record database through manual entry. The instrument information includes further details regarding the type of payment. For example, for a credit card, the instrument information may include data on the name of the credit card (e.g., MasterCard, Visa, or American Express), the credit card number, the expiration date of the credit card, and billing information for the credit card (e.g., billing name and address). In a preferred embodiment of the present invention, only a partial credit card number is displayed to the advertiser for security purposes.

The default values displayed to the advertiser are obtained from a persistent state, e.g., stored in the account database. In an embodiment of the present invention, the stored billing information values may comprise the values set by the advertiser the last (e.g. most recent) time the process of adding money was invoked and completed for the advertiser's account. The default billing information is displayed to the advertiser in a web-based form. The advertiser may click on the appropriate text entry boxes on the web-based form and make changes to the default billing information. After the advertiser completes the changes, the advertiser may click on a hyperlinked “Submit” button provided on the form to request that the system update the billing information and current balance in step 608. Once the advertiser has requested an update, a function is invoked by the system which validates the billing information provided by the advertiser and displays it back to the advertiser for confirmation, as shown in step 610. The confirmation billing information is displayed in read-only form and may not be changed by the advertiser.

The validation step functions as follows. If payment is to be debited from an advertiser's external account, payment may be authenticated, authorized and completed using the system set forth in U.S. Pat. No. 5,724,424 to Gifford. However, if the payment type is by credit card, a validating algorithm is invoked by the system, which validates the credit card number using a method such as that set forth in U.S. Pat. No. 5,836,241 to Stein et al. The validating algorithm also validates the expiration date via a straightforward comparison with the current system date and time. In addition, the function stores the new values in a temporary instance prior to confirmation by the advertiser.

Once the advertiser ascertains that the displayed data is correct, the advertiser may click on a “Confirm” button provided on the page to indicate that the account should be updated in step 612. In step 612, a function is invoked by the system which adds money to the appropriate account balance, updates the advertiser's billing information, and appends the billing information to the advertiser's payment history. The advertiser's updated billing information is stored to the persistent state (e.g., the account record database) from the temporary instance.

Within the function invoked at step 612, a credit card payment function may be invoked by the system at step 614. In an alternate embodiment of the present invention, other payment functions such as debit card payments may be invoked by defining multiple payment types depending on the updated value of the payment type.

If the payment type is credit card, the user's account is credited immediately at step 616, the user's credit card having already been validated in step 610. A screen showing the status of the add money transaction is displayed, showing a transaction number and a new current balance, reflecting the amount added by the just-completed credit card transaction.

In an alternate embodiment of the present invention, after the money has been added to the account, the amount of money added to the account may be allocated between subaccounts the end of the add money process at step 616. If the advertiser has no subaccounts, all of the money in the account is a general allocation. However, if the advertiser has more than one subaccount, the system will display a confirmation and default message prompting the advertiser to “Allocate Money Between Subaccounts”.

The menu selection “Allocate Money Between Subaccounts” may be invoked when money is added to the advertiser account after step 616 of FIG. 6, or it may be invoked within the “Account Management” menu 170 shown in FIG. 2. The “Account Management” menu 170 is accessible from the Advertiser Main Page 120, as shown in FIG. 2. This “Allocate Money Between Subaccounts” menu selection permits an advertiser to allocate current and any pending balances of the advertiser's account among the advertiser's subaccounts. The system will then update the subaccount balances. The current balance allocations will be made in real time, while the pending balance allocations will be stored in the persistent state. A routine will be invoked to update the subaccount balances to reflect the pending balance allocations when the payment for the pending balance is processed. Automatic notification may be sent to the advertiser at that time, if requested. This intuitive online account management and allocation permits advertisers to manage their online advertising budget quickly and efficiently. Advertisers may replenish their accounts with funds and allocate their budgets, all in one easy web-based session. The computer-based implementation eliminates time consuming, high cost manual entry of the advertiser's account transactions.

The “Allocate Money Between Subaccounts” routine begins when an advertiser indicates the intent to allocate money by invoking the appropriate menu selection at the execution points indicated above. When the advertiser indicates the intent to allocate, a function is invoked by the system to determine whether there are funds pending in the current balance (i.e., unactivated account credits) that have not yet been allocated to the advertiser's subaccounts, and displays the balance selection options. In a preferred embodiment of the present invention, an account instance is created and a pending current balance account field is set from the persistent state.

If there are no unallocated pending funds, the system may display the current available balances for the account as a whole as well as for each subaccount. The advertiser then distributes the current available balance between subaccounts and submits a request to update the balances. A function is invoked which calculates and displays the current running total for subaccount balances. The current running total is stored in a temporary variable which is set to the sum of current balances for all subaccounts for the specified advertiser. The function also validates the new available subaccount balances to make sure that the total does not exceed the authorized amount. If the new advertiser-set available subaccount balances does not exceed the authorized amount, a function is invoked which will update all of the subaccount balances in the persistent state and display the update in read-only format.

If there are pending funds in the current account balance, the pending funds must be allocated separately from the available current balance. The pending funds will then be added into the available current balance when the funds are received. The function must therefore prompt the advertiser to choose between allocating pending funds or allocating available funds. The allocating pending funds selection works in much the same manner as the allocating available funds selection outlined above. After the advertiser chooses to allocate pending funds, a routine is invoked to display current pending balances for the account and the subaccounts. The advertiser distributes the pending subaccount balances between campaigns and submits a request to update the balances. A function is invoked which calculates and displays the current running totals for the pending subaccount balances. This function also validates the new pending subaccount allocations to make sure that the allocations do not exceed any authorized amount. The current running total of pending allocations is set to the sum of current pending balances for all subaccounts for the advertiser. If the new user-set pending subaccount balances or the total of such balances do not exceed any authorized amount, the function will update all of the pending subaccount allocations in the persistent state, e.g. the advertiser's account in the database, and display the update in read-only format.

As indicated above and shown in FIG. 2, a routine displaying the account management menu 170 may be invoked from the advertiser main menu 120. Aside from the “Allocate Money Between Subaccounts” selection described above, the remaining selections all use to some extent the search listings present in the advertiser's account on the database, and may also affect the advertiser's entry in the search result list. Thus, a further description of the search result list generated by the search engine is needed at this point.

When a remote searcher accesses the search query page on the search engine web server 24 and executes a search request according to the procedure described previously, the search engine web server 24 preferably generates and displays a search result list where the “canonicalized” entry in search term field of each search listing in the search result list exactly matches the canonicalized search term query entered by the remote searcher. The canonicalization of search terms used in queries and search listings removes common irregularities of search terms entered by searches and web site promoters, such as capital letters and pluralizations, in order to generate relevant results. However, alternate schemes for determining a match between the search term field of the search listing and the search term query entered by the remote searcher are well within the scope of the present invention. For example, string matching algorithms known in the art may be employed to generate matches where the keywords of the search listing search term and the search term query have the same root but are not exactly the same (e.g., computing vs. computer). Alternatively a thesaurus database of synonyms may be stored at search engine web server 24, so that matches may be generated for a search term having synonyms. Localization methodologies may also be employed to refine certain searches. For example, a search for “bakery” or “grocery store” may be limited to those advertisers within a selected city, zip code, or telephone area code. This information may be obtained through a cross-reference of the advertiser account database stored at storage 32 on account management server 22.

Finally, internationalization methodologies may be employed to refine searches for users outside the United States. For example, country or language-specific search results may be generated, by a cross-reference of the advertiser account database, for example.

An example of a search result list display used in an embodiment of the present invention is shown in FIG. 7, which is a display of the first several entries resulting from a search for the term “zip drives”. As shown in FIG. 7, a single entry, such as entry 710 a in a search result list consists of a description 720 of the web site, preferably comprising a title and a short textual description, and a hyperlink 730 which, when clicked by a searcher, directs the searcher's browser to the URL where the described web site is located. The URL 740 may also be displayed in the search result list entry 710 a, as shown in FIG. 7. The “click through” of a search result item occurs when the remote searcher viewing the search result item display 710 of FIG. 7 selects, or “clicks” on the hyperlink 730 of the search result item display 710. In order for a “click through” to be completed, the searcher's click should be recorded at the account management server and redirected to the advertiser's URL via the redirect mechanism discussed above.

Search result list entries 710 a–710 h may also show the rank value of the advertiser's search listing. The rank value is an ordinal value, preferably a number, generated and assigned to the search listing by the processing system 34 of FIG. 1. Preferably, the rank value is assigned through a process, implemented in software, that establishes an association between the bid amount, the rank, and the search term of a search listing. The process gathers all search listings that match a particular search term, sorts the search listings in order from highest to lowest bid amount, and assigns a rank value to each search listing in order. The highest bid amount receives the highest rank value, the next highest bid amount receives the next highest rank value, proceeding to the lowest bid amount, which receives the lowest rank value. Most preferably, the highest rank value is 1 with successively increasing ordinal values (e.g., 2, 3, 4, . . . ) assigned in order of successively decreasing rank. The correlation between rank value and bid amount is illustrated in FIG. 7, where each of the paid search list entries 710 a through 71 Of display the advertiser's bid amount 750 a through 750 f for that entry. Preferably, if two search listings having the same search term also have the same bid amount, the bid that was received earlier in time will be assigned the higher rank value. Unpaid listings 710 g and 710 h do not display a bid amount and are displayed following the lowest-ranked paid listing. Preferably, unpaid listings are displayed if there are an insufficient number of listings to fill the 40 slots in a search results page. Unpaid listings are generated by a search engine utilizing objective distributed database and text searching algorithms known in the art. An example of such a search engine may be operated by Inktomi Corporation. The original search query entered by the remote searcher is used to generate unpaid listings through the conventional search engine.

As shown in the campaign management menu 170 of FIG. 2, several choices are presented to the advertiser to manage search listings. First, in the “Change Bids” selection, the advertiser may change the bid of search listings currently in the account. The process invoked by the system for the change bids function is shown in FIG. 8. After the advertiser indicates the intent to change bids by selecting the “Change Bids” menu option, the system searches the user's account in the database and displays the search listings for the entire account or a default subaccount in the advertiser's account, as shown in step 810. Search listings may be grouped into subaccounts defined by the advertiser and may comprise one or more search listings. Only one subaccount may be displayed at a time. The display should also preferably permit the advertiser to change the subaccount selected, as shown in step 815. The screen display will then show the search listings for the selected subaccount, as indicated in step 820.

An example of screen display shown to the advertiser in step 810 is shown in FIG. 9 and will be discussed below. To change bids, the advertiser user may specify new bids for search terms for which the advertiser already has an existing bid by entering a new bid amount into the new bid input field for the search term. The advertiser-entered bid changes are displayed to the advertiser at step 820 of FIG. 8 as discussed above. To update the bids for the display page, the advertiser requests, at step 830 of FIG. 8, to update the result of changes. The advertiser may transmit such a request to the account management server by a variety of means, including clicking on a button graphic.

As shown in step 840 of FIG. 8, upon receiving the request to update the advertiser's bids, the system calculates the new current bid amounts for every search listing displayed, the rank values, and the bid amount needed to become the highest ranked search listing matching the search term field. Preferably, the system then presents a display of changes at step 850. After the user confirms the changes, the system updates the persistent state by writing the changes to the account in the database.

The search listing data is displayed in tabular format, with each search listing corresponding to one row of the table 900. The search term 902 is displayed in the leftmost column, followed by the current bid amount 904, and the current rank 906 of the search listing. The current rank is followed by a column entitled “Bid to become #1” 907, defined as the bid amount needed to become the highest ranked search listing for the displayed search term. The rightmost column of each row comprises a new bid input field 908 which is set initially to the current bid amount.

As shown in FIG. 9, the search listings may be displayed as “subaccounts.” Each subaccount comprises one search listing group, with multiple subaccounts residing within one advertiser account. Each subaccount may be displayed on a separate display page having a separate page. The advertiser should preferably be able to change the subaccount being displayed by manipulating a pull-down menu 910 on the display shown in FIG. 9. In addition, search listing groups that cannot be displayed completely in one page may be separated into pages which may be individually viewed by manipulating pull-down menu 920. Again, the advertiser should preferably be able to change the page displayed by clicking directly on a pull-down menu 920 located on the display page of FIG. 9. The advertiser may specify a new bid for a displayed search listing by entering a new bid amount into the new bid input field 908 for the search listing. To update the result of the advertiser-entered changes, the advertiser clicks on button graphic 912 to transmit an update request to the account management server, which updates the bids as described above.

Many of the other selections listed in the “Account Management” menu 170 of FIG. 2 function as variants of the “Change Bid” function described above. For example, if the advertiser selects the “Change Rank Position” option, the advertiser may be presented with a display similar to the display of FIG. 9 used in the “Change Bid” function. However, in the “Change Rank Position” option, the “New Bid” field would be replaced by a “New Rank” field, in which the advertiser enters the new desired rank position for a search term. After the advertiser requests that the ranks be updated, the system then calculates a new bid price by any of a variety of algorithms easily available to one skilled in the art. For example, the system may invoke a routine to locate the search listing in the search database having the desired rank/search term combination, retrieve the associated bid amount of said combination, and then calculate a bid amount that is N cents higher; where N=1, for example. After the system calculates the new bid price and presents a read-only confirmation display to the advertiser, the system updates the bid prices and rank values upon receiving approval from the advertiser.

The “Modify Listing Component” selection on Account Management menu 170 of FIG. 2 may also generate a display similar to the format of FIG. 9. When the advertiser selects the “Modify Listing Component” option, the advertiser may input changes to the URL, title, or description of a search listing via web-based forms set up for each search listing. Similar to the process discussed above, the forms for the URL, title, and description fields may initially contain the old URL, title and description as default values. After the advertiser enters the desired changes, the advertiser may transmit a request to the system to update the changes. The system then displays a read-only confirmation screen, and then writes the changes to the persistent state (e.g., the user account database) after the advertiser approves the changes.

A process similar to those discussed above may be implemented for changing any other peripheral options related to a search listing; for example, changing the matching options related to a bidded search term. Any recalculations of bids or ranks required by the changes may also be determined in a manner similar to the processes discussed above.

In the “Delete Bidded Search Term” option, the system retrieves all of the search listings in the account of the advertiser and displays the search listings in an organization and a format similar to the display of FIG. 9. Each search listing entry may include, instead of the new bid field, a check box for the advertiser to click on. The advertiser would then click to place a check (X) mark next to each search term to be deleted, although any other means known in the art for selecting one or more items from a list on a web page may be used. After the advertiser selects all the search listings to be deleted and requests that the system update the changes, the system preferably presents a read-only confirmation of the requested changes, and updates the advertiser's account only after the advertiser approves the changes. The “deleted” search listings are removed from the search database 36 and will not appear in subsequent searches. However, the search listing will remain as part of the advertiser's account record for billing and account activity monitoring purposes.

In the “Add Bidded Search Term” option, the system provides the advertiser with a display having a number of entry fields corresponding to the elements of a search listing. The advertiser then enters into each field information corresponding to the respective search listing element, including the search term, the web site URL, the web site title, the web site description, and the bid amount, as well as any other relevant information. After the advertiser has completed entering the data and has indicated thus to the system, the system returns a read-only confirmation screen to the advertiser. The system then creates a new search listing instance and writes it into the account database and the search database upon receiving approval from the advertiser.

Preferably, the “Account Management” menu 170 of FIG. 2 provides a selection for the advertiser to “Get Suggestions On Bidded Search Term”. In this case, the advertiser enters a bidded search term into a form-driven query box displayed to the advertiser. The system reads the search term entered by the advertiser and generates a list of additional related search terms to assist the advertiser in locating search terms relevant to the content of the advertiser's web site. Preferably, the additional search terms are generated using methods such as a string matching algorithm applied to a database of bidded search terms and/or a thesaurus database implemented in software. The advertiser may select search terms to bid on from the list generated by the system. In that case, the system displays to the advertisers the entry fields described above for the “Add Bidded Search Term” selection, with a form for entering a search listing for each search term selected. Preferably, the selected search term is inserted as a default value into the form for each search listing. Default values for the other search listing components may also be inserted into the forms if desired.

The “Account Management” menu 170 of FIG. 2 also preferably provides advertisers with a “Project Expenses” selection. In this selection, the advertiser specifies a search listing or subaccount for which the advertiser would like to predict a “daily run rate” and “days remaining to expiration.” The system calculates the projections based on a cost projection algorithm, and displays the predictions to the advertiser on a read-only screen. The predictions may be calculated using a number of different algorithms known in the art. However, since the cost of a search listing is calculated by multiplying the bid amount by the total number of clicks received by the search listing at that bid amount during a specified time period, every cost projection algorithm must generally determine an estimated number of clicks per month (or other specified time period) for a search listing. The clicks on a search listing may be tracked via implementation of a software counting mechanism as is well known in the art. Clicks for all search listings may be tracked over time, this data may be used to generate estimated numbers of clicks per month overall, and for individual search terms. For a particular search term, an estimated number of searches per day is determined and is multiplied by the cost of a click. This product is then multiplied by a ratio of the average number of clicks over the average number of impressions for the rank of the search listing in question to obtain a daily run rate. The current balance may be divided by the daily run rate to obtain a projected number of days to exhaustion or “expiration” of account funds.

One embodiment of the present invention bases the cost projection algorithm on a simple predictor model that assumes that every search term performs in a similar fashion. This model assumes that the rank of the advertiser's search listing will remain constant and not fluctuate throughout the month. This algorithm has the advantages of being simple to implement and fast to calculate. The predictor model is based on the fact that the click through rate, e.g. the total number of clicks, or referrals, for a particular searcher listing, is considered to be a function of the rank of the search listing.

The model therefore assumes that the usage curve of each search term, that is, the curve that result when the number of clicks on a search listing is plotted against the rank of the search listing, is similar to the usage curve for all search terms. Thus, known values extrapolated over time for the sum of all clicks for all search terms, the sum of all clicks at a given rank for all search terms, and the sum of all clicks for the selected search term may be employed in a simple proportion to determine the total of all clicks for the given rank for the selected search term. The estimated daily total of all clicks for the selected search term at the selected rank is then multiplied by the advertiser's current bid amount for the search term at that rank to determine a daily expense projection. In addition, if particular search terms or classes of search terms are known to differ markedly from the general pattern, correction values specific to the search term, advertiser, or other parameter may be introduced to fine-tune the projected cost estimate.

Finally, the “Account Management” menu 170 of FIG. 2 provides several selections to view information related to the advertiser's campaigns. The “View Subaccount Information” selection displays read-only information related to the selected subaccount. The “View Search Term List” selection displays the list of the advertiser's selected search terms along with the corresponding URLs, bid price, and rank, with the search terms preferably grouped by subaccount. The advertiser may also view current top bids for a set of search terms selected from a list of search terms from a read-only display generated by the system upon receiving the requested search terms from the advertiser.

For an advertiser who requires a more comprehensive report of search listing activity, the “View Report” option may be selected from the Advertiser Main Page 120 of FIG. 2. In an embodiment of the present invention, the “View Report” options generate reports comprehensive for up to one year preceding the current date. For example, daily reports are available for the each of the immediately preceding 7 days, weekly reports for the preceding four weeks, monthly reports for the preceding twelve months, and quarterly reports for the last four quarters. Additional reports may also be made available depending on advertiser interest. Other predefined report types may include activity tracked during the following time periods: Since Inception of the Account, Year To Date, Yearly, Quarter To Date, Month To Date, and Week to Date. Report Categories may include a Detail Report, viewable by Advertiser Account, by Search Listing, and by URL, and a Summary Report, viewable by Advertiser Account and by Subaccount. The reports may include identification data such as advertiser account and subaccount name, the dates covered by the report and the type of report. In addition, the reports may include key search listing account data such as current balance, pending current balance, average daily account debit, and run rate. Furthermore, the reports may also include key data, such as: search terms, URLs, bids, current ranks, and number of clicks, number of searches done for the search term, number of impressions (times that the search listing appeared in a search result list), and click through rate (defined as Number of Clicks/Number of Impressions). Preferably, the report is available in at least HTML view options for viewing via a browser program, printing, or downloading. Note, however, that other view options may be made available, such as Adobe Acrobat, PostScript, ASCII text, spreadsheet interchange formats (e.g., CSV, tab-delimited), and other well-known formats.

When the advertiser has selected the “View Report” option, the system invokes a function which displays a list of available report types, dates, categories, and view options. The system preferably creates a report instance with the following fields, all of which are initially set to null: report type, report date, report category, and view option. Once the advertiser has defined the parameters described above, the system invokes a function to generate the requested report, based on the advertiser-set parameters, and to display the report, based on the view option parameter.

A preferred embodiment of the present invention implements an option for context specific help that the advertiser may request at any time the advertiser is logged in. The help option may be implemented as a small icon or button located on the system generated display page. The advertiser may click on the icon or button graphic on the display page to request help, upon which the system generates and displays a help page keyed to the function of the particular display the user is viewing. The help may be implemented as separate display pages, a searchable index, dialog boxes, or by any other methods well known in the art.

Other embodiments permit more flexible selection and display of search listings among the search results provided to the searcher. These include variations which affect three dimensions: the number N of listings displayed in the provided search results; the manner of selecting which listings are displayed, and the way the selected listings are ranked or ordered for display.

Each listing that matches a given user search has an associated bid for a user action, e.g. for a clickthrough. The “bid rank” is the rank position of a listing among the set of matching listings sorted in descending order of bid. Tie-breaking may be done by chronological seniority, with the earliest placed bid being bid-ranked higher. The “display rank” is the relative position of a listing as displayed. The “display quantity” is the number of listings displayed.

In the first of these variations, a predetermined number N of line listing display positions are populated with the N highest bidders, with tie-breaking by seniority. The N line listings appear in the N display positions in random order. The display order may be randomly selected at each display opportunity, or may change periodically or a periodically. The display order may be re-shuffled every time there is a change in tenancy of the display positions, that is, when a line listing moves in or out of the display set. The display order may be re-shuffled every time a web site promoter associated with one of the tenants makes an upward bid, or every time the bid rank of a listing improves, and otherwise be held fixed (as long as tenancy doesn't change). This embodiment provides an incentive for a web site promoter to increase a bid until the promoter has a favorable rank.

This variation can be expanded upon by allowing the bid rank to have an influence on the probability distribution of the display rank for that bid rank. In this form, the probability for the highest bidder to appear in the top spot of N displayed listings is greater than 1/N but less than unity, with similar probabilities for the other bidder ranks to land in various display ranks, favoring listings with high bid rank in the high display ranks. This method can be adjusted along a continuum from the totally-random display ranking just described, to the strict deterministic bid ranking of the preferred embodiment, by varying one or more parameters of a suitable algorithm.

In a second variation, the N highest-bidded listings are displayed in a randomized order weighted by bid. One method for accomplishing this makes the probability that a given search listing appears first in the search result list proportional to the bid for that search listing. After the first-ranked display position is chosen by a bid-weighted random drawing, the remaining N−1 listings subsequently participate in a similar bid-weighted random drawing for the second-ranked display position, and so forth until the N^(th) position, which is occupied by the loser of all the previous drawings. This method preserves a strong motivation for a web site promoter to increase a bid to increase traffic to the associated web site. Further, the N listings displayed may be drawn from more than N bidded listings, e.g. by the random drawing method of this second variation.

In a variation that can be applied to any of these methods, the quantity N of listings displayed is not predetermined, it is a function of the bids. In one form of this, the probability that a given listing is included in the display set is a function of the bid for that listing, in comparison to the highest bid. One way to do this is to divide all the bids by the highest bid to obtain a “normalized bid”, and then use the normalized bid as a probability of inclusion. This will normally include using some value M for the maximum number of listings to display, or alternately, the maximum number of listings to examine for possible display. Variations employing these methods allow the high bidder to both 1) guarantee his inclusion in the listings displayed, and 2) suppress the appearance of his competition by bidding higher. A sufficiently high bid in relation to the competition can be used to “drive the competition off the page” most of the time, providing an incentive to the. high bidder to increase his bid.

FIG. 10 is a flow diagram illustrating a method for selecting search listings for display as search results. One technique for implementing the selection of a variable quantity of listings to display is by the illustrated method. In this method, the Matching Listings is the set of listings which match a given query. The Examination List is an ordered set of listings, as is the Selection List. The Examination List is populated from the Matching Listings in bid rank order, from which the algorithm then fills the Selection List, forming the principal output of the algorithm.

This method is adjustable in behavior by varying the value of a real number parameter W throughout the range of zero to large positive values, and a positive integer parameter M which specifies the maximum number of listings to examine for possible display. The method begins at block 200.

At block 202, matching listings are located. This corresponds to the conventional operation of a search engine in any suitable embodiment. The search request is received from a searcher and search listings having a matching relationship with the search request are located and identified. A matching relationship is a logical connection or link between the search request and a search listing which causes the search listing to be selected for presentation to the searcher submitting the search request. For example, the matching relationship might be a literal match between words of the search request and the search listing. Alternatively, the search listing may specify a search term and related search term with a matching relationship being established when either the search term or related search terms are matched.

The result is a set of Matching Listings. At block 204, the Matching Listings are sorted in bid rank order. As noted above, the bid rank is the rank position of a listing among the set of Matching Listings sorted in descending order of bid, with tie breaking by chronological seniority.

At block 206, the Examination List is initialized to be an empty list. Subsequent steps will at least partially fill the list forming the Examination List.

At block 208, the Examination List at least partially filled by appending Matching Listings from the sorted Matching Listings generated in block 204 to the Examination List. The Matching Listings are appended to the Examination List in bid rank order as they appear in the sorted Matching Listings. Appending of Matching Listings continues in this embodiment until M listings have been appended, or until no more Matching Listings remain in the sorted list.

At block 210, the variable T is set equal to the bid amount of the listing which is located at the head of the Examination List. The position within the Examination List may be determined by using a pointer or other variable. At block 212, the Selection List is initialized to be an empty list.

A looping operation begins at block 214. At block 214, the variable R is set to a randomly chosen real value uniformly distributed in the interval from 0 up to but not including 1. At block 216, the variable V is set to the bid amount of the listing of the head of the Examination List. At block 218, it is determined if R is less than the quantity B divided by T raised to the power W. If so, at block 220, the first listing of the Exam List is removed from the Exam List and appended to the Selection List. At block 222, it is determined that the Exam List is empty. If so, the method ends. Otherwise, control returns to block 214 and processing continues.

If, at block 218, it was determined that R is not less than B divided by T raised to the power W, the listing at the head of the Examination List is removed and discarded, block 226. At block 228, it is again determined if the Exam List is now empty. If so, at block 230 the method ends. If not, control returns to block 214 for further processing.

The method of FIG. 10 is further illustrated by the pseudocode shown below. This pseudocode and the method illustrated in FIG. 10 may be adapted to any suitable embodiment. In particular, it may be adapted as program code in C++ or Java implemented on a web server and operated by a pay for performance search engine operator.

-   Bid-weighted display selection drawing with weight-shaping parameter     W>=zero, examining no more than M candidate listings: -   Find Matching Listings; -   Sort Matching Listings in bid rank order; -   Initialize the Examination List to be an empty list; -   Append Matching Listings in bid rank order to the Examination List     until M listings have been appended, or no Matching Listings remain; -   Set T to the bid of the listing at the head of the Examination List; -   Initialize the Selection List to be an empty list; -   While the Examination List is not empty, do {     -   Set R to a randomly-chosen real value uniformly distributed in         the interval from zero up to but not including one;     -   Set B to the bid of the listing at the head of the Examination         List;     -   If R is less than (B divided by T) raised to power W, then         remove the listing from the head of the Examination List and         append it to the Selection List,     -   Otherwise remove the listing from the head of the Examination         List and discard it;

FIG. 11 is a flow diagram illustrating an alternative embodiment of a method for selecting search listing for display as search results. In this variation, a positive integer parameter M specifies the maximum number of listings to select for display, which may involve examining more than M candidate listings from the Examination List. The method proceeds similarly to the method illustrated in FIG. 10.

The first several blocks parallel those out the method of FIG. 10. The method begins at block 200; at block 202, listings matching the search request received from a searcher are located. These Matching Listings are sorted in bid rank order at block 204. An Examination List is initialized at block 206.

At block 302, Matching Listings which have been sorted in block 204 are appended in bid rank order to the Examination List until no more listings remain. That is, all matching listings are placed in the Examination List.

At block 210, the variable T is initialized to the value of the bid associated with the first search listing at the head of the Examination List produced at block 302. At block 212, the Selection List is initialized. At block 214, a random number R is chosen having a real value uniformly distributed in the interval from 0 up to but not including 1. At block 216, the variable V is set to be the bid amount of the listing at the head of the Examination List. At block 218, the illustrated test is performed. If the result of the test of block 218 produces an affirmative response, at block 220, the Selected Listing is removed from the head of the Examination List and appended to the Selection List. At block 222, it is determined if the Examination List is empty. If so, the method ends at block 224. If the Examination List is not yet empty, at block 304, it is determined if fewer than M listings remain in the Selection List. If so, control returns to block 214. If not, control proceeds to block 224 and the method ends.

If, at block 218, a negative result was returned, at block 226 the listing is removed from the head of the Examination List and discarded. At block 228 it is determined if the Examination List is empty. If so, the method ends at block 230. If not, control returns to block 214.

The following pseudocode forms an additional embodiment of the method illustrated in FIG. 11.

Bid-weighted display selection drawing with weight-shaping parameter W>=zero, choosing no more than M listings to display:

-   Find Matching Listings; -   Sort Matching Listings in bid rank order; -   Initialize the Examination List to be an empty list; -   Append Matching Listing in bid rank order to the Examination List     until no more listings remain; -   Set T to bid of the listing at the head of the Examination List; -   Initialize the Selection List to be an empty list; -   While the Examination List is not empty and the quantity of listings     in the Selection List is less than M, do {     -   Set R to a randomly-chosen real value uniformly distributed in         the interval from zero up to but not including one;     -   Set B to the bid the listing at the head of the Examination         List;     -   If R is less than (B divided by T) raised to the power W, then         remove the listing from the head of the Examination List and         append it to the Selection List,     -   Otherwise remove the listing from the head of the Examination         List and discard it;

When the parameter W is given the value 1, matching listings are candidates for the Selection List with probability of inclusion equal to their bids relative to the highest bid of the matching listings, until that point where the Selection List is filled with M listings. When parameter W is given a value less than 1, the bid of a listing relative to the maximum bid in the set has a less-than-proportional influence on the probability of the listing being included in the Selection List. Conversely, when parameter W is given a value greater than 1, the bid of a listing relative to the maximum bid in the set has a more-than-proportional influence on the probability of the listing being included in the Selection List. Other algorithms, operating with other parameters, will be evident to one skilled in the art of computer algorithms, and are within the scope of the present invention.

Once a Selection List of matching listings has been obtained, other algorithms can be used to order the listings for display. One algorithm is to display the selected listings in strict bid rank order. Other algorithms may be employed, which introduce a random element to the ordering of the results.

FIG. 12 is a flow diagram illustrating a method for ordering selected listings for display as search results. In the illustrated method, listings are ordered by a random drawing weighted by bid.

The method of FIG. 12 begins at block 400. At block 402, a variable V is set to the sum of the bids of the listings in the Selection List. At block 404, the Display List is initialized to be an empty list. The Display List will be subsequently filled, at least in part.

At block 406, the variable R is set to a randomly chosen real value uniformly distributed in the interval from 0 up to but not including 1. At block 408, the Selection List pointer is set to point to the head of the Selection List. At block 410, the variable A is set to the bid value of the listing pointed to by the Selection List pointer. At block 412, the Selection List pointer (SLP) is advanced or incremented to the next listing. At block 414, that listings bid is added to the value A. At block 416, a test is made to determine if A is less than the value of R multiplied by V. If not, control returns to block 412. If so, control proceeds to block 418 where the bid of the listing pointed to by Selection List pointer is subtracted from the variable V. Subsequently, at block 420, the listing pointed to by the Selection List pointer is removed from the Selection List and appended to the Display List. At block 422, it is determined if the Selection List is empty. If so, the method terminates at block 224. If not, control returns to block 406 for selection of the next random number.

The following pseudocode forms another embodiment of the method illustrated in FIG. 12.

-   Bid-weighted display order drawing: -   Set V to the sum of the bids of the listings in the Selection List; -   Initialize the Display List to be an empty list; -   While the Selection List is not empty do {     -   Set R to a randomly-chosen real value uniformly distributed in         the interval from zero up to but including one;     -   Set Selection List Pointer to point to the head of the Selection         List;     -   Set A to the bid of the listing pointed to by the Selection List         Pointer;     -   While A is less than the value of R multiplied by V do {         -   Advance the Selection List Pointer to the next listing;         -   Add that listing's bid to A;     -   }     -   Subtract the bid of the listing pointed to by the Selection List         Pointer from V;     -   Remove the listing pointed to by the Selection List Pointer from         the Selection List and append it to the Display List; -   }

Ordering algorithms employing a random element can include one or more parameters to vary the relative influence of that random element versus the bid or bid rank of the selected listings. FIG. 13 is flow diagram illustrating a method for ordering selected listings for display as search results. In this method, a single parameter S, a real number in the range of zero to one inclusive, is employed.

The method of FIG. 13 begins at block 450. At block 452, the Display List is initialized to be an empty list, to be subsequently filled by elements of the Selection List. At block 454, the variable Q is set to be the number of entries in the Selection List. At block 456, the Selection List pointer is set to point to the head of the Selection List. At block 458, a logical flag is set to a false value. At block 460, the variable T is initialized to the value Q raised to the minus S power, as shown in FIG. 13.

At block 462, the variable R is set to a randomly chosen real value uniformly distributed in the interval from 0 up to but not including 1. At block 464, it is determined if the value of R is less than the value of T. If so, at block 466, the logical flag is set to a true value. Control proceeds to block 472.

If, at block 464, R was not less than T, at block 468 the Selection List pointer is advanced to the next listing in sequence in the Selection List. At block 470, the value of Q is reduced or decremented by 1.

At block 472, it is determined if the flag is set to a true value. If not, control passes back to block 460, where a new value of T is calculated and the process repeats. If so, control passes forward to block 474, where the listing pointed to by the Search Listing Pointer is removed from the Selection List and appended to the Display list. At block 476, the Selection List is examined to determine if it is empty. If no more listings remain in the Selection List, the algorithm has filled out the Display list, and ends at block 478. If the Selection List is not empty, control passes back to block 454, where the variable Q is updated to reflect the new quantity of listings remaining, and the process continues.

The following pseudocode forms another embodiment of the method illustrated in FIG. 13.

Bid-rank-weighted display order drawing with weighting parameter S in [0.1]:

Initialize the Display List to be an empty list; While the Selection List is not empty do { Set Q to the number of listings in the Selection List; Set Selection List Pointer to point to the head of the Selection List; Set flag F to the Boolean value “FALSE”; While flag F is “FALSE”, do { Set T to the value Q raised to the −S power; Set R to a randomly-chosen real value uniformly distributed in the interval from zero up to but not including one; If R is less than T then set flag F to the Boolean value “TRUE”, Otherwise do { Advance Selection List Pointer to the next listing in sequence in the Selection List; Reduce the value of Q by one; } } Remove the listing pointed to by the Selection List Pointer from the Selection List and append it to the Display List; }

Suitable adjustment of the parameters W and S can obtain a variety of behaviors. For example, when both W and S are set to zero, this algorithm gives results identical to the preferred embodiment. When W is set to zero and S is set to one, the top N listings by bid rank are selected and displayed in completely random order.

These illustrated methods and algorithms are intended to be illustrative rather than inclusive. Other algorithms or means can be employed to introduce an element of randomness to diverge from a strict bid rank ordering of a fixed number of display positions. One skilled in the art of computer programming can also readily make improvements to the computational efficiency of these algorithms, as appropriate to a particular implementation.

From the foregoing, it can be seen that the present embodiments provide a method and apparatus for controlling the position at which search listings are displayed in search results provided to a user. The methods are sufficiently flexible to allow variation from a completely random selection and display to a completely deterministic selection and display based on bid amount. These variations allow the operator of a pay for performance search engine to manage search listing display in order to improve and even maximize revenue, by controlling the degree to which web site operators' willingness to pay for traffic influences the prominence of search listings for those web sites in the search result display. These variations further allow advertisers or web site promoters to better manage their placement in search result listings, to manage the traffic produced at their web sites and to manage their advertising expenditures.

While a particular embodiment of the present invention has been shown and described, modifications may be made. It is therefore intended in the appended claims to cover such changes and modifications which follow in the true spirit and scope of the invention. 

1. A computer implemented method for operating a search system, the method comprising: storing a plurality of search listing records, each search listing record including data defining a search term, data defining a bid amount chargeable to an advertiser upon receipt of a click through selecting the search listing among displayed search results; receiving from the advertiser a new desired rank for a search listing; based on other search listings associated with the search term of the search listing, automatically determining a new bid amount for the search listing required to achieve the new desired rank for the search listing; and automatically updating the stored search listing with the new bid amount.
 2. The method of claim 1 wherein determining the new bid amount comprises: locating a search listing for the search term having a rank no greater than the new desired rank; retrieving bid amount associated with the located search listing; and determining a bid N cents higher than the retrieved bid amount.
 3. The method of claim 2 wherein N=1.
 4. The method of claim 2 further comprising: receiving a confirmation from the advertiser; and updating the data defining the bid amounts for the plurality of search listing records. 